Specifications for decidable hybrid games

نویسندگان

Vladimeros Vladimerou

Pavithra Prabhakar

Mahesh Viswanathan

Geir E. Dullerud

چکیده

We introduce STORMED hybrid games (SHG), a generalization of STORMED Hybrid Systems [33], which have natural specifications that allow rich continuous dynamics and various decidable properties. We solve the control problem for SHG using a reduction to bisimulation on finite game graphs. This generalizes to a greater family of games, which includes o-minimal hybrid games [6]. We also solve the optimal-cost reachability problem for Weighted SHG and prove decidability of WCTL for Weighted STORMED hybrid systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

STORMED Hybrid Games

We introduce STORMED hybrid games (SHG), a generalization of STORMED Hybrid Systems [21], which have natural specifications, allow rich continuous dynamics and admit various properties to be decidable. We solve the control problem for SHG using a reduction to bisimulation on game graphs. This reduction generalizes to a greater family of games, which includes o-minimal hybrid games [5]. We also ...

متن کامل

Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets

We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuous dynamics. A number of analysis problems, such as reachability testing and controller synthesis, are decidable for classes of ominimal hybrid automata. We generalize existing decidability results for controller synthesis on h...

متن کامل

Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!

We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” which increase while the system evolves but do not constrain the behaviour of the system. In this paper, we prove two main results: (i) optimal o-minimal hybrid games are decidable; (ii) the model-checking of WCTL, an extension of CTL ...

متن کامل

For Decidable Hybrid Automata and Games

Using hybrid automata, one is able to model many types of systems and express their properties in various formal languages. Being extremely general and rich, however, the class of hybrid automata exhibits the inherent problems of automata theory: even the simplest of properties for general hybrid automata are undecidable. Therefore, one must restrict attention only to subclasses of this very ge...

متن کامل